Biased Random Walk on the Trace of Biased Random Walk on the Trace of …

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The speed of biased random walk on percolation clusters

We consider biased random walk on supercritical percolation clusters in Z. We show that the random walk is transient and that there are two speed regimes: If the bias is large enough, the random walk has speed zero, while if the bias is small enough, the speed of the random walk is positive.

متن کامل

Biased random walk in energetically disordered lattices

We utilize our previously reported model of energetically disordered lattices to study diffusion properties, where we now add the effect of a directional bias in the motion. We show how this leads to ballistic motion at low temperatures, but crosses over to normal diffusion with increasing temperature. This effect is in addition to the previously observed subdiffusional motion at early times, w...

متن کامل

Information Filtering via Biased Random Walk on Coupled Social Network

The recommender systems have advanced a great deal in the past two decades. However, most researchers focus their attentions on mining the similarities among users or objects in recommender systems and overlook the social influence which plays an important role in users' purchase process. In this paper, we design a biased random walk algorithm on coupled social networks which gives recommendati...

متن کامل

Einstein relation for biased random walk on Galton–Watson trees

We prove the Einstein relation, relating the velocity under a small perturbation to the diffusivity in equilibrium, for certain biased random walks on Galton–Watson trees. This provides the first example where the Einstein relation is proved for motion in random media with arbitrary deep traps.

متن کامل

The cover time of a biased random walk on a random cubic graph

Our aim in this paper is to analyse a variation on a simple random walk that may tend to speed up the cover time of a connected graph. This variation is just one of several possible approaches which include (i) non-bactracking walks, see Alon, Benjamini, Lubetzky and Sodin [3], (ii) walks that prefer unused edges, see Berenbrink, Cooper and Friedetzky [4] or (iii) walks that a biassed toward lo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Communications in Mathematical Physics

سال: 2019

ISSN: 0010-3616,1432-0916

DOI: 10.1007/s00220-019-03585-3